Computational indistinguishability - PDFSEARCH.IO - Document Search Engine

Computational indistinguishability
Results: 24

#	Item
11	Inductive Trace Properties for Computational Security Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University Abstract. Protocol authentication properties are generally Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2006-12-27 15:51:40 Advantage Cryptographic protocol Cipher XTR Cryptography Ciphertext indistinguishability Semantic security
12	Efficient, Adaptively Secure, and Composable Oblivious Transfer with a Single, Global CRS Seung Geol Choi∗ Jonathan Katz† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-05-14 14:54:31 Ciphertext indistinguishability Oblivious transfer Computational indistinguishability Cryptographic hash function Chosen-ciphertext attack Zero-knowledge proof Diffie–Hellman problem RSA Cryptography Cryptographic protocols Common reference string model
13	Fully Automated Analysis of Padding-Based Encryption in the Computational Model ´sar Kunz, Benedikt Schmidt∗ Gilles Barthe, Juan Manuel Crespo, Ce ´goire† Benjamin Gre Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2013-07-03 12:04:07 RSA Advantage XTR Random oracle Probabilistic encryption Cryptography Optimal asymmetric encryption padding Ciphertext indistinguishability
14	Survey on Cryptographic Obfuscation M´at´e Horv´ath∗ Laboratory of Cryptography and System Security (CrySyS Lab)† April 24, 2015 Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2015-04-24 07:02:48 Complexity classes Obfuscation Circuit complexity Obfuscated code Ciphertext indistinguishability International Obfuscated C Code Contest NC Semantic security Multilinear map Theoretical computer science Computer programming Computational complexity theory
15	The proceedings version of this paper appears in ACM CCSThis is the full version of that paper. Robust Computational Secret Sharing and a Unified Account of Classical Secret-Sharing Goals Mihir Bellare∗ Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2007-08-20 03:48:31 Commitment scheme Proactive secret sharing Ciphertext indistinguishability Adversary model Advantage Cryptography Cryptographic protocols Secret sharing
16	An extended abstract of this paper appears in the proceedings of the 11th ACM Conference on Computer and Communications Security—CCS 2004, Washington, DC, OctoberThis expanded version is available from the IACR Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2004-12-15 15:22:16 Computational complexity theory Coding theory Randomness Randomness extractor Extractor Advantage Ciphertext indistinguishability Leftover hash lemma Adversary model Cryptography Theoretical computer science Applied mathematics
17	Constant-Round Concurrent Zero-knowledge from Indistinguishability Obfuscation Kai-Min Chung∗ Huijia Lin† Add to Reading List Source URL: eprint.iacr.org Language: English - Date: 2014-12-18 08:37:34 Complexity classes Cryptographic protocols Zero-knowledge proof Interactive proof system Soundness NP IP Commitment scheme P/poly Theoretical computer science Computational complexity theory Cryptography
18	DattaKuestersMitchellRamanathan-TCC-2005.dvi Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-12-18 01:20:50 Computing Cryptographic protocols Models of computation Universal composability Turing machine Security parameter Computational complexity theory Actor model Ciphertext indistinguishability Theoretical computer science Applied mathematics Cryptography
19	Inductive Trace Properties for Computational Security Arnab Roy, Anupam Datta, Ante Derek, John C. Mitchell Department of Computer Science, Stanford University Abstract. Protocol authentication properties are generally Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2007-12-18 00:33:31 Advantage Cryptographic protocol Cipher XTR Cryptography Ciphertext indistinguishability Semantic security
20	Quantum computational indistinguishability and zero-knowledge John Watrous School of Compupter Science and Institute for Quantum Computing Add to Reading List Source URL: www.fields.utoronto.ca Language: English - Date: 2006-10-10 16:07:17 Applied mathematics Quantum information science Ciphertext indistinguishability Identical particles Quantum computer Qubit Density matrix Quantum operation Physics Theoretical computer science Quantum mechanics

UPDATE